Quantum complexity theory - PDFSEARCH.IO - Document Search Engine

Quantum complexity theory
Results: 258

#	Item
121	QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:53:50 Quantum complexity theory Quantum information science Models of computation QMA Interactive proof system PP Arthur–Merlin protocol Quantum computer BQP Theoretical computer science Computational complexity theory Applied mathematics
122	100 SETH LLOYD creates new bits of information, bits which previously did not exist. In other words, quantum mechanics, via decoherence, is constantly Add to Reading List Source URL: spiritualscientific.com Language: English - Date: 2011-03-28 09:40:16 Information theory Randomness Models of computation Cryptography Quantum computer Seth Lloyd Algorithmic information theory Quantum mechanics Complexity Applied mathematics Science Theoretical computer science
123	Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:06 NP-complete problems Matching Combinatorial optimization Graph coloring Vertex cover Bipartite graph Adjacency matrix Independent set Shortest path problem Graph theory Mathematics Theoretical computer science
124	Tools for Quantum Circuit Synthesis Chelsea Voss 6.845, Quantum Complexity Theory Fall 2014 Motivation Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:36 Quantum circuit Quantum gate Quantum computer Qubit Logic gate Toffoli gate Circuit Computer Controlled NOT gate Theoretical computer science Quantum information science Applied mathematics
125	On Quantum Sieve Approaches to the Lattice Shortest Vector Problem Daniel Epelbaum December[removed] Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:11 Quantum algorithms Cryptography Group theory Computational complexity theory Lattice problem Lattice Hidden subgroup problem Lenstra–Lenstra–Lovász lattice basis reduction algorithm Quantum computer Mathematics Theoretical computer science Algebra
126	Complexity of the Quantum Separability Problem and Its Variants Charles Xu December 12, 2014 Abstract We review a family of tightly related complexity-theoretic results introduced in two Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:42 Applied mathematics Quantum information science Quantum complexity theory Separable states QMA QIP Interactive proof system PP Quantum entanglement Theoretical computer science Physics Quantum mechanics
127	On Applications of the Equilibrium Value Method Serena Booth December 12th, 2014 Abstract In 2010, Jain et al. [JJUW10] provided the first proof that QIP = PSPACE. Jain et al. used a Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:00 Computational complexity theory Quantum complexity theory QIP IP Interactive proof system QMA PSPACE BQP Soundness Theoretical computer science Applied mathematics Complexity classes
128	Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Solution assignment 1 Due: February 22, 2010 A. PAC Learning Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2010-05-05 14:22:51 PP Quantum complexity theory
129	Report on Dagstuhl Seminar[removed]Semantics of Information Organized by Michael Mislove Tulane University Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-09-14 03:18:34 Models of computation Quantum information science Computational complexity theory Classes of computers Quantum computer Khovanov homology Quantum algorithm Quantum circuit Algorithm Theoretical computer science Applied mathematics Mathematics
130	Solving LWE problem with bounded errors in polynomial time Jintai Ding1,2 Southern Chinese University of Technology, 1 University of Cincinnati, 2 [removed] Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-11-02 07:13:56 Cryptography Computational complexity theory Information theory Models of computation Learning with errors Lattice problem Quantum computer PP Low Theoretical computer science Applied mathematics Mathematics

UPDATE